Chromatic index, treewidth and maximum degree
نویسندگان
چکیده
منابع مشابه
Chromatic index, treewidth and maximum degree
We conjecture that any graphG with treewidth k and maximum degree ∆(G) ≥ k + √ k satisfies χ′(G) = ∆(G). In support of the conjecture we prove its fractional version.
متن کاملThe chromatic index of graphs with large maximum degree
By Vizing’s theorem, the chromatic index x’(G) of a simple graph G satisfies d(G) Li 1 V(G)1 J + ir, where r is the number of vertices of maximum degree. A graph G is critical if G is Class 2 and x’(H) < x’(G) for all prop...
متن کاملThe Game Chromatic Index of Forests of Maximum Degree 5
Using a refinement of the methods of Erdös et al. [6] we prove that the game chromatic index of forests of maximum node degree 5 is at most 6. This improves the previously known upper bound 7 for this parameter. The bound 6 is tight [6].
متن کاملThe chromatic index of a graph whose core has maximum degree two
Let G be a graph. The core of G, denoted by G∆, is the subgraph of G induced by the vertices of degree ∆(G), where ∆(G) denotes the maximum degree of G. A k-edge coloring of G is a function f : E(G)→ L such that |L| = k and f(e1) 6= f(e2) for all two adjacent edges e1 and e2 of G. The chromatic index of G, denoted by χ′(G), is the minimum number k for which G has a k-edge coloring. A graph G is...
متن کاملOn the chromatic index of graphs whose core has maximum degree two
Let G be a connected graph. The core of G, denoted by G∆, is the subgraph of G induced by the vertices of maximum degree. Hilton and Zhao [On the edge-colouring of graphs whose core has maximum degree two, JCMCC 21 (1996), 97-108] conjectured that, if ∆(G∆) ≤ 2, then G is Class 2 if and only if G is overfull, with the sole exception of the Petersen graph with one vertex deleted. In this paper w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Discrete Mathematics
سال: 2016
ISSN: 1571-0653
DOI: 10.1016/j.endm.2016.09.045